A possibilistic approach to restore consistency in answer set programming
نویسندگان
چکیده
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic where there exist some techniques to handle this inconsistency. In this work, we propose to manage inconsistent logic programs in a similar way as possibilistic logic does for classical logic. We compute a consistent subprogram keeping the most important rules of the original program. This importance is described by a necessity degree assigned to each rule.
منابع مشابه
An Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty
The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...
متن کاملA dynamic bi-objective model for after disaster blood supply chain network design; a robust possibilistic programming approach
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
متن کاملSemantics for Possibilistic Disjunctive Programs
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic th...
متن کاملPossibilistic Answer Set Programming Revisited
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP p...
متن کاملPossibilistic Answer Set Programming Revisited
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP p...
متن کامل